Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document
نویسندگان
چکیده
منابع مشابه
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document
The information in many applications can be naturally represented as graph-structured XML document. Structural query on graph structured XML document matches the subgraph of graph structured XML document on some given schema. The query processing of graphstructured XML document brings new challenges. In this paper, for the processing of subgraph query, we design a subgraph join algorithm based ...
متن کاملIndexing graph-structured XML data for efficient structural join operation
Structural join has been established as a primitive technique for matching the binary containment pattern, specifically the parent–child and ancestor–descendant relationship, on the tree XML data. While current indexing approaches and evaluation algorithms proposed for the structural join operation assume the tree-structured data model, the presence of reference links in XML documents may rende...
متن کاملFast XML Structural Join Algorithms by Partitioning
An XML structural join evaluates structural relationships (e.g. parent-child or ancestordescendant) between XML elements. It serves as an important computation unit in XML pattern matching. Several classical structural join algorithms have been proposed such as Stack-tree join and XR-Tree join. In this paper, we consider to answer the problem of structural join by partitioning. The Dietz number...
متن کاملTopological Queries on Graph-structured XML Data: Models and Implementations
In many applications, data is in graph structure, which can be naturally represented as graph-structured XML. Existing queries defined on tree-structured and graph-structured XML data mainly focus on subgraph matching, which can not cover all the requirements of querying on graph. In this paper, a new kind of queries, topological query on graph-structured XML is presented. This kind of queries ...
متن کاملHash-Based Structural Join Algorithms
Algorithms for processing Structural Joins embody essential building blocks for XML query evaluation. Their design is a difficult task, because they have to satisfy many requirements, e. g., guarantee linear worst-case runtime; generate sorted, duplicate-free output; adapt to fiercely varying input sizes and element distributions; enable pipelining; and (probably) more. Therefore, it is not pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: World Wide Web
سال: 2008
ISSN: 1386-145X,1573-1413
DOI: 10.1007/s11280-008-0050-4